First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian fluctuation in random matrices.

Let N(L) be the number of eigenvalues, in an interval of length L, of a matrix chosen at random from the Gaussian Orthogonal, Unitary or Symplectic ensembles of N by N matrices, in the limit N → ∞. We prove that [N(L) − 〈N(L)〉]/√logL has a Gaussian distribution when L → ∞. This theorem, which requires control of all the higher moments of the distribution, elucidates numerical and exact results ...

متن کامل

Invertibility of symmetric random matrices

We study n × n symmetric random matrices H, possibly discrete, with iid abovediagonal entries. We show that H is singular with probability at most exp(−nc), and ‖H−1‖ = O(√n). Furthermore, the spectrum of H is delocalized on the optimal scale o(n−1/2). These results improve upon a polynomial singularity bound due to Costello, Tao and Vu, and they generalize, up to constant factors, results of T...

متن کامل

Spectra of sparse random matrices

We compute the spectral density for ensembles of of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of the one suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaus...

متن کامل

Sparse Recovery Using Sparse Random Matrices

Over the recent years, a new *linear* method for compressing high-dimensional data (e.g., images) has been discovered. For any high-dimensional vector x, its *sketch* is equal to Ax, where A is an m x n matrix (possibly chosen at random). Although typically the sketch length m is much smaller than the number of dimensions n, the sketch contains enough information to recover an *approximation* t...

متن کامل

Symmetric Groups and Random Matrices

The convolution of indicators of two conjugacy classes on the symmetric group Sq is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys–Murphy element involves many conjugacy classes with complicated coefficients. In this article we consider a combinatorial setup which allows us to manipulate such products easily and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2012

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/45/32/325001